Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops

JOURNAL ARTICLE published June 1981 in Operations Research

Authors: Yookun Cho | Sartaj Sahni

Scheduling jobs in open shops with limited machine availability

JOURNAL ARTICLE published April 2002 in RAIRO - Operations Research

Authors: Jacek Błażewicz | Piotr Formanowicz

Single Machine Preemptive Scheduling to Minimize the Weighted Number of Late Jobs with Deadlines and Nested Release/Due Date Intervals

JOURNAL ARTICLE published January 2001 in RAIRO - Operations Research

Authors: Valery S. Gordon | F. Werner | O. A. Yanushkevich

Scheduling independent jobs with stochastic processing times and a common due date on parallel and identical machines

JOURNAL ARTICLE published December 1989 in Annals of Operations Research

Authors: Erdal Erel | Subhash C. Sarin

Preemptive Scheduling with Due Dates

JOURNAL ARTICLE published October 1979 in Operations Research

Authors: Sartaj Sahni

Optimal control rules for scheduling job shops

JOURNAL ARTICLE published December 1989 in Annals of Operations Research

Authors: Sheldon X. C. Lou | Garrett Van Ryzin

A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates

JOURNAL ARTICLE published December 2010 in Annals of Operations Research

Authors: Kailiang Xu | Zuren Feng | Liangjun Ke

Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates

JOURNAL ARTICLE published August 1988 in Operations Research

Authors: C. Y. Liu | R. L. Bulfin

Multiple orders per job batch scheduling with incompatible jobs

JOURNAL ARTICLE published March 2008 in Annals of Operations Research

Authors: Vishnu Erramilli | Scott J. Mason

Multi-objective optimization of integrated lot-sizing and scheduling problem in flexible job shops

JOURNAL ARTICLE published July 2016 in RAIRO - Operations Research

Authors: Mohammad Rohaninejad | Rashed Sahraeian | Behdin Vahedi Nouri

Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times

JOURNAL ARTICLE published February 2017 in Annals of Operations Research

Authors: Jun Pei | Xinbao Liu | Panos M. Pardalos | Wenjuan Fan | Shanlin Yang

A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs

JOURNAL ARTICLE published December 1990 in Annals of Operations Research

Authors: E. L. Lawler

Scheduling jobs on heterogeneous processors

JOURNAL ARTICLE published December 1991 in Annals of Operations Research

Authors: Rhonda Righter | Susan XU

Scheduling Jobs with Release and Delivery Times Subject to Nested Eligibility Constraints

JOURNAL ARTICLE published March 2021 in Journal of the Operations Research Society of China

Research funded by National Natural Science Foundation of China (11771251)

Authors: Yu-Zhong Zhang | Shu-Guang Li

Preemptive Scheduling with Availability Constraints to Minimize Total Weighted Completion Times

JOURNAL ARTICLE published January 2005 in Annals of Operations Research

Authors: Guoqing Wang | Hongyi Sun | Chengbin Chu

Scheduling unit — time tasks on flow — shops under resource constraints

JOURNAL ARTICLE published December 1988 in Annals of Operations Research

Authors: J. Błażewicz | W. Kubiak | J. Szwarcfiter

Comments on “Scheduling jobs on a k-stage flexible flow-shop” [Annals of Operations Research (2008) 164: 29–40]

JOURNAL ARTICLE published November 2009 in Annals of Operations Research

Authors: R. Ramezanian | A. Karamouzian

Complexity of Scheduling Shops with No Wait in Process

JOURNAL ARTICLE published November 1979 in Mathematics of Operations Research

Authors: Sartaj Sahni | Yookun Cho

Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs

JOURNAL ARTICLE published July 2009 in Annals of Operations Research

Authors: Mitre Costa Dourado | Rosiane de Freitas Rodrigues | Jayme Luiz Szwarcfiter

Preemptive multi-skilled resource constrained project scheduling problem with hard/soft interval due dates

JOURNAL ARTICLE published November 2019 in RAIRO - Operations Research

Authors: Hamidreza Maghsoudlou | Behrouz Afshar-Nadjafi | Seyed Taghi Akhavan Niaki